Polygons Folding to Plural Incongruent Orthogonal Boxes
نویسنده
چکیده
We investigate the problem of finding orthogonal polygons that fold to plural incongruent orthogonal boxes. There are two known polygons that fold to produce two incongruent orthogonal boxes. In this paper, we show that there are infinite such polygons. We also show that there exists a tile that produces two incongruent orthogonal boxes.
منابع مشابه
Common Developments of Several Different Orthogonal Boxes
We investigate the problem of finding common developments that fold to plural incongruent orthogonal boxes. It was shown that there are infinitely many orthogonal polygons that fold to two incongruent orthogonal boxes in 2008. In this paper, we first show that there is an orthogonal polygon that fold to three boxes of size 1×1×5, 1 × 2 × 3, and 0 × 1 × 11. Although we have to admit a box to hav...
متن کاملCommon Developments of Three Different Orthogonal Boxes
We investigate common developments that can fold into plural incongruent orthogonal boxes. It was shown that there are infinitely many orthogonal polygons that fold into two incongruent orthogonal boxes in 2008. In 2011, it was shown that there exists an orthogonal polygon that folds into three boxes of size 1 × 1 × 5, 1 × 2 × 3, and 0×1×11. It remained open whether there exists an orthogonal p...
متن کاملCommon Developments of Three Incongruent Boxes of Area 30
We investigate common developments that can fold into plural incongruent orthogonal boxes. Recently, it was shown that there are infinitely many orthogonal polygons that folds into three boxes of different size. However, the smallest one that folds into three boxes consists of 532 unit squares. From the necessary condition, the smallest possible surface area that can fold into two boxes is 22, ...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملResolving uncertainty in plural predication
Plural predications (e.g., "the boxes are heavy") are common sources of ambiguity in everyday language, allowing both distributive and collective interpretations (e.g., the boxes each are heavy vs. the boxes together are heavy). This paper investigates the role of context in the disambiguation of plural predication. We address the key phenomenon of "stubborn distributivity," whereby certain pre...
متن کامل